Asymptotically-optimal Path Planning on Manifolds
نویسندگان
چکیده
This paper presents an approach for optimal path planning on implicitly-defined configuration spaces such as those arising, for instance, when manipulating an object with two arms or with a multifingered hand. In this kind of situations, the kinematic and contact constraints induce configuration spaces that are manifolds embedded in higher dimensional ambient spaces. Existing sampling-based approaches for path planning on manifolds focus on finding a feasible solution, but they do not optimize the quality of the path in any sense. Thus, the returned paths are usually not suitable for direct execution. Recently, RRT* and other similar asymptotically-optimal path planners have been proposed to generate high-quality paths in the case of globally parametrizable configuration spaces. In this paper, we propose to use higher dimensional continuation tools to extend RRT* to the case of implicitly-defined configuration spaces. Experiments in different problems validate the proposed approach.
منابع مشابه
Efficient asymptotically-optimal path planning on manifolds
This paper presents an efficient approach for asymptotically-optimal path planning on implicitly-defined configuration spaces. Recently, several asymptotically-optimal path planners have been introduced, but they typically exhibit slow convergence rates. Moreover, these planners can not operate on the configuration spaces that appear in the presence of kinematic or contact constraints, such as ...
متن کاملIntegrating asymptotically-optimal path planning with local optimization
Many robots operating in unpredictable environments require an online path planning algorithm that can quickly compute high quality paths. Asymptotically optimal planners are capable of finding the optimal path, but can be slow to converge. Local optimisation algorithms are capable of quickly improving a solution, but are not guaranteed to converge to the optimal solution. In this paper we deve...
متن کاملSampling-based Volumetric Methods for Optimal Feedback Planning
We present a sampling-based, asymptotically optimal feedback planning method for the shortest path problem among obstacles in R. Our method combines an incremental sampling-based Delaunay triangulation with the newly introduced Repairing Fast Marching Method for computing a converging sequence of control policies. The convergence rate and asymptotic computational complexity of the algorithm are...
متن کاملMobile Robot Path Planning by RRT* in Dynamic Environments
Robot navigation is challenging for mobile robots technology in environments with maps. Since finding an optimal path for the agent is complicated and time consuming, path planning in robot navigation is an axial issue. The objective of this paper is to find a reasonable relation between parameters used in the path planning algorithm in a platform which a robot will be able to move from the sta...
متن کاملAnalysis of Asymptotically Optimal Sampling-based Motion Planning Algorithms for Lipschitz Continuous Dynamical Systems
Over the last 20 years significant effort has been dedicated to the development of samplingbased motion planning algorithms such as the Rapidly-exploring Random Trees (RRT) and its asymptotically optimal version (e.g. RRT∗). However, asymptotic optimality for RRT∗ only holds for linear and fully actuated systems or for a small number of non-linear systems (e.g. Dubin’s car) for which a steering...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012